The Anti-kekulé Number of the Infinite Triangular, Rectangular and Hexagonal Grids
نویسندگان
چکیده
The anti-Kekulé number is the smallest number of edges that must be removed from a connected graph with a perfect matching so that the graph remains connected, but has no perfect matching. In this paper the values of the Anti-Kekulé numbers of the infinite triangular, rectangular and hexagonal grids are found, and they are, respectively, 9, 6 and 4.
منابع مشابه
On periodicity of two-dimensional words
A two-dimensional word is a function on Z with finite number of values. The main problem we are interested in is periodicity of twodimensional words satisfying some local conditions. In this paper we prove that every bounded centered function on the infinite rectangular grid is periodic. A function is called centered if the sum of its values in every ball is equal to 0. Similar results are obta...
متن کاملPure 2D picture grammars and languages
A new syntactic model, called pure 2D context-free grammar (P2DCFG), is introduced based on the notion of pure context-free string grammar. The rectangular picture generative power of this 2D grammar model is investigated. Certain closure properties are obtained. An analogue of this 2D grammar model called pure 2D hexagonal context-free grammar (P2DHCFG) is also considered to generate hexagonal...
متن کاملHexaGrowth: a new Grid Generation with a Local Algorithm
In various previous works about pattern formation methods on top of P2P networks have been discussed. Most of structures had done by the rectangular grids building methods, which could later be used to improve the efficiency of routing and data search algorithms. In this contribution, another new, local working algorithm is introduced, which allows the formation of other than rectangular grids....
متن کاملHerrmann 1 Tom Kamphans 2 Elmar Langetepe 1 Exploring Simple Triangular and Hexagonal Grid Polygons Online
We investigate the online exploration problem (aka covering) of a short-sighted mobile robot moving in an unknown cellular environment with hexagons and triangles as types of cells. To explore a cell, the robot must enter it. Once inside, the robot knows which of the 3 or 6 adjacent cells exist and which are boundary edges. The robot’s task is to visit every cell in the given environment and to...
متن کاملExploring Simple Triangular and Hexagonal Grid Polygons Online
We investigate the online exploration problem (aka covering) of a short-sighted mobile robot moving in an unknown cellular environment with hexagons and triangles as types of cells. To explore a cell, the robot must enter it. Once inside, the robot knows which of the 3 or 6 adjacent cells exist and which are boundary edges. The robot’s task is to visit every cell in the given environment and to...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008